On products of integers. II
نویسندگان
چکیده
1. Throughout this paper, c 1 , c2 , . . . denote absolute constants ; ko (a, fl, . . .), kr (a, f3, . . .), . . ., xo (a, /3, . . .), . . . denote constants depending only on the parameters a, /l, . . . ; v(n) denotes the number of the prime factors of the positive integer n, counted according to their multiplicity . The number of the elements of a finite set S is denoted by I S I . Let k, n be any positive integers, A={ar , a2 , . . ., a„} any finite, strictly increasing sequence of positive integers satisfying
منابع مشابه
Almost Perfect Powers in Consecutive Integers (ii)
Let k 4 be an integer. We find all integers of the form by where l 2 and the greatest prime factor of b is at most k (i.e. nearly a perfect power) such that they are also products of k consecutive integers with two terms omitted.
متن کاملALGEBRAIC INDEPENENCE OF CERTAIN FORMAL POWER SERIES (II)
We shall extend the results of [5] and prove that if f = Z o a x ? Z [[X]] is algebraic over Q (x), where a = 1, ƒ 1 and if ? , ? ,..., ? are p-adic integers, then 1 ? , ? ,..., ? are linkarly independent over Q if and only if (1+x) ,(1+x) ,…,(1+x) are algebraically independent over Q (x) if and only if f , f ,.., f are algebraically independent over Q (x)
متن کاملOn a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOn sums and products of integers
Let 1 0 there is an n , so that for every n > n :, there are more than n'-' distinct integers of the form (1). We are very far from being able to prove this, but we prove the following weaker Theorem 1. Denote bt /(n) the largest integer ...
متن کامل